Algorithms for Propagating Uncertainty Across Heterogeneous Domains
نویسندگان
چکیده
We address an important research area in stochastic multi-scale modeling, namely the propagation of uncertainty across heterogeneous domains characterized by partially correlated processes with vastly different correlation lengths. This class of problems arise very often when computing stochastic PDEs and particle models with stochastic/stochastic domain interaction but also with stochastic/deterministic coupling. The domains may be fully embedded, adjacent or partially overlapping. The fundamental open question we address is the construction of proper transmission boundary conditions that preserve global statistical properties of the solution across different subdomains. No rigorous theory or even effective empirical algorithms have yet been developed for this purpose, although interfaces defined in terms of functionals of random fields (e.g., multi-point cumulants) can overcome the computationally prohibitive problem of preserving sample-path continuity across domains. The key idea of our new methods relies on combining local reduced-order representations of random fields with multi-level domain decomposition. Specifically, we propose two new algorithms: The first one enforces the continuity of the mean and the variance of the solution across adjacent subdomains by using Schwarz iterations. The second algorithm is based on PDEconstrained multi-objective optimization, and it allows us to set more general interface conditions. The effectiveness of these new algorithms is demonstrated in numerical examples involving elliptic problems with random diffusion coefficients, stochastically advected scalar fields, and nonlinear advection-reaction problems with random reaction rates.
منابع مشابه
Image Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملPoint Dose Measurement for Verification of Treatment Planning System using an Indigenous Heterogeneous Pelvis Phantom for Clarkson, Convolution, Superposition, and Fast Superposition Algorithms
Background: Nowadays, advanced radiotherapy equipment includes algorithms to calculate dose. The verification of the calculated doses is important to achieve accurate results. Mostly homogeneous dosimetric phantoms are available commercially which do not mimic the actual patient anatomy; therefore, an indigenous heterogeneous pelvic phantom mimicking actual human pelvic region has been used to ...
متن کاملOn Combining Side Information and Unlabeled Data for Heterogeneous Multi-Task Metric Learning
Distance metric learning (DML) is critical for a wide variety of machine learning algorithms and pattern recognition applications. Transfer metric learning (TML) leverages the side information (e.g., similar/dissimilar constraints over pairs of samples) from related domains to help the target metric learning (with limited information). Current TML tools usually assume that different domains exp...
متن کاملApplication of truncated gaussian simulation to ore-waste boundary modeling of Golgohar iron deposit
Truncated Gaussian Simulation (TGS) is a well-known method to generate realizations of the ore domains located in a spatial sequence. In geostatistical framework geological domains are normally utilized for stationary assumption. The ability to measure the uncertainty in the exact locations of the boundaries among different geological units is a common challenge for practitioners. As a simple a...
متن کاملBayesian uncertainty quantification and propagation in molecular dynamics simulations: a high performance computing framework.
We present a Bayesian probabilistic framework for quantifying and propagating the uncertainties in the parameters of force fields employed in molecular dynamics (MD) simulations. We propose a highly parallel implementation of the transitional Markov chain Monte Carlo for populating the posterior probability distribution of the MD force-field parameters. Efficient scheduling algorithms are propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 37 شماره
صفحات -
تاریخ انتشار 2015